Edge Search Number of Cographs in Linear Time
نویسندگان
چکیده
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our result, the knowledge on graph searching of cographs is now complete: node, mixed, and edge search numbers of cographs can all be computed efficiently. Furthermore, we are one step closer to computing the edge search number of permutation graphs.
منابع مشابه
Edge search number of cographs
We give a linear-time algorithm for computing the edge search number of cographs, thereby resolving the computational complexity of edge searching on this graph class. To achieve this we give a characterization of the edge search number of the join of two graphs. With our result, the knowledge on graph searching of cographs is now complete: node, mixed, and edge search numbers of cographs can a...
متن کاملAdding an Edge in a Cograph
In this paper, we establish structural properties of cographs which enable us to present an algorithm which, for a cograph G and a non-edge xy (i.e., two non-adjacent vertices x and y) of G, finds the minimum number of edges that need to be added to the edge set of G such that the resulting graph is a cograph and contains the edge xy. The motivation for this problem comes from algorithms for th...
متن کاملIndependent sets in edge-clique graphs
We show that the edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in O(n4) time. We show that the independent set problem on edge-clique g...
متن کاملIndependent sets in edge-clique graphs II
We show that edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in polynomial time. We show that the independent set problem on edge-clique ...
متن کاملWeighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees
For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-coloring of the vertices of a graph such that the total weight of vertices of each color equals a given value in each part of a fixed partition of the vertices exists. We also show that this result is tight in some sens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009